ABC implies primitive prime divisors in arithmetic dynamics
نویسندگان
چکیده
Let K be a number field, let φ(x) ∈ K(x) be a rational function of degree d > 1, and let α ∈ K be a wandering point such that φ(α) = 0 for all n > 0. We prove that if the abc-conjecture holds for K, then for all but finitely many positive integers n, there is a prime p of K such that vp(φ (α)) > 0 and vp(φ (α)) 0 for all positive integers m < n. Under appropriate ramification hypotheses, we can replace the condition vp(φ (α)) > 0 with the stronger condition vp(φ (α)) = 1. We prove the same result unconditionally for function fields of characteristic 0 when φ is not isotrivial.
منابع مشابه
Primitive Prime Divisors in Polynomial Arithmetic Dynamics
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been significantly studied for several classes of linear recurrence sequences and for elliptic divisibility sequences. In this paper, we consider the question for sequences generated by the iteration of a polynomial. For two classes of polynomials f(x) ∈ Z[x] and initial values a1 ∈ Z, we show that th...
متن کاملArithmetic Progressions with Common Difference Divisible by Small Primes
n(n + d) . . . (n + (k − 1)d) = by (1.1) in positive integers n, k ≥ 2, d > 1, b, y, l ≥ 3 with l prime, gcd(n, d) = 1 and P (b) ≤ k. We write d = D1D2 (1.2) where D1 is the maximal divisor of d such that all prime divisors of D1 are congruent to 1 ( mod l). Thus D1 and D2 are relatively prime positive integers such that D2 has no prime divisor which is congruent to 1 (mod l). Shorey [Sh88] pro...
متن کاملPrimitive Divisors in Arithmetic Dynamics
Let φ(z) ∈ Q(z) be a rational function of degree d ≥ 2 with φ(0) = 0 and such that φ does not vanish to order d at 0. Let α ∈ Q have infinite orbit under iteration of φ and write φ(α) = An/Bn as a fraction in lowest terms. We prove that for all but finitely many n ≥ 0, the numerator An has a primitive divisor, i.e., there is a prime p such that p | An and p ∤ Ai for all i < n. More generally, w...
متن کاملRFSC 04-01 Revised A PROOF OF THE ODD PERFECT NUMBER CONJECTURE
It is sufficient to prove that there is an excess of prime factors in the product of repunits with odd prime bases defined by the sum of divisors of the integer N = (4k+1) ∏l i=1 q 2αi i to establish that there do not exist any odd integers with equality between σ(N) and 2N. The existence of distinct prime divisors in the repunits in σ(N) follows from a theorem on the primitive divisors of the ...
متن کاملOn Positive Numbers U For
Let n be a positive integer n and let uj(n), 0 (n) 3 r (n) ? (n) and a(n) be the classical arithmetic functions of n. That is, cj(n), fi(n), and r(n) count the number of distinct prime divisors of n, the total number of prime divisors of n, and the number of divisors of n, respectively, while 4>(n) and a(n) are the Euler function of n and the sum of divisors function of n respectively. A lot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013